Filtros : "Annals of Operations Research" Limpar

Filtros



Refine with date range


  • Source: Annals of Operations Research. Unidade: EP

    Subjects: PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO LINEAR, PROGRAMAÇÃO POR RESTRIÇÕES, OTIMIZAÇÃO COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      NASCIMENTO, Oliviana Xavier do e QUEIROZ, Thiago Alves de e JUNQUEIRA, Leonardo. A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts. Annals of Operations Research, v. 20 No 2019, p. 31 on-line, 2019Tradução . . Disponível em: https://doi.org/10.1007/s10479-019-03466-x. Acesso em: 27 abr. 2024.
    • APA

      Nascimento, O. X. do, Queiroz, T. A. de, & Junqueira, L. (2019). A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts. Annals of Operations Research, 20 No 2019, 31 on-line. doi:10.1007/s10479-019-03466-x
    • NLM

      Nascimento OX do, Queiroz TA de, Junqueira L. A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts [Internet]. Annals of Operations Research. 2019 ; 20 No 201931 on-line.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-019-03466-x
    • Vancouver

      Nascimento OX do, Queiroz TA de, Junqueira L. A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts [Internet]. Annals of Operations Research. 2019 ; 20 No 201931 on-line.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-019-03466-x
  • Source: Annals of Operations Research. Unidade: FEARP

    Subjects: RESPONSABILIDADE SOCIAL, GESTÃO DE PROJETOS, STAKEHOLDER

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CAMARGO, José Alberto de et al. Giving voice to the silent: a framework for understanding stakeholders’ participation in socially-oriented initiatives, community-based actions and humanitarian operations projects. Annals of Operations Research, v. fe, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10479-017-2426-2. Acesso em: 27 abr. 2024.
    • APA

      Camargo, J. A. de, Mendonça, P. S. M., Oliveira, J. H. C. de, Jabbour, C. J. C., & Jabbour, A. B. L. de S. (2017). Giving voice to the silent: a framework for understanding stakeholders’ participation in socially-oriented initiatives, community-based actions and humanitarian operations projects. Annals of Operations Research, fe. doi:10.1007/s10479-017-2426-2
    • NLM

      Camargo JA de, Mendonça PSM, Oliveira JHC de, Jabbour CJC, Jabbour ABL de S. Giving voice to the silent: a framework for understanding stakeholders’ participation in socially-oriented initiatives, community-based actions and humanitarian operations projects [Internet]. Annals of Operations Research. 2017 ;fe[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-017-2426-2
    • Vancouver

      Camargo JA de, Mendonça PSM, Oliveira JHC de, Jabbour CJC, Jabbour ABL de S. Giving voice to the silent: a framework for understanding stakeholders’ participation in socially-oriented initiatives, community-based actions and humanitarian operations projects [Internet]. Annals of Operations Research. 2017 ;fe[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-017-2426-2
  • Source: Annals of Operations Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      COSTA, Alysson Machado et al. Sustainable vegetable crop supply problem with perishable stocks. Annals of Operations Research, v. 219, n. 1, p. 265-283, 2014Tradução . . Disponível em: https://doi.org/10.1007/s10479-010-0830-y. Acesso em: 27 abr. 2024.
    • APA

      Costa, A. M., Santos, L. M. R. dos, Alem, D. J., & Santos, R. H. S. (2014). Sustainable vegetable crop supply problem with perishable stocks. Annals of Operations Research, 219( 1), 265-283. doi:10.1007/s10479-010-0830-y
    • NLM

      Costa AM, Santos LMR dos, Alem DJ, Santos RHS. Sustainable vegetable crop supply problem with perishable stocks [Internet]. Annals of Operations Research. 2014 ; 219( 1): 265-283.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-010-0830-y
    • Vancouver

      Costa AM, Santos LMR dos, Alem DJ, Santos RHS. Sustainable vegetable crop supply problem with perishable stocks [Internet]. Annals of Operations Research. 2014 ; 219( 1): 265-283.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-010-0830-y
  • Source: Annals of Operations Research. Unidade: EACH

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CONSTANTINO, Ademir Aparecido et al. A heuristic algorithm based on multi-assignment procedures for nurse scheduling. Annals of Operations Research, v. 218, n. 1, p. 165-183, 2014Tradução . . Disponível em: https://doi.org/10.1007/s10479-013-1357-9. Acesso em: 27 abr. 2024.
    • APA

      Constantino, A. A., Landa-Silva, D., Melo, E. L. de, Mendonça Neto, C. F. X. de, Rizzato, D. B., & Romão, W. (2014). A heuristic algorithm based on multi-assignment procedures for nurse scheduling. Annals of Operations Research, 218( 1), 165-183. doi:10.1007/s10479-013-1357-9
    • NLM

      Constantino AA, Landa-Silva D, Melo EL de, Mendonça Neto CFX de, Rizzato DB, Romão W. A heuristic algorithm based on multi-assignment procedures for nurse scheduling [Internet]. Annals of Operations Research. 2014 ; 218( 1): 165-183.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-013-1357-9
    • Vancouver

      Constantino AA, Landa-Silva D, Melo EL de, Mendonça Neto CFX de, Rizzato DB, Romão W. A heuristic algorithm based on multi-assignment procedures for nurse scheduling [Internet]. Annals of Operations Research. 2014 ; 218( 1): 165-183.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-013-1357-9
  • Source: Annals of Operations Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SANTOS, Lana Mara Rodrigues dos et al. Crop rotation scheduling with adjacency constraints. Annals of Operations Research, v. 190, n. 1, p. 165-180, 2011Tradução . . Disponível em: https://doi.org/10.1007/s10479-008-0478-z. Acesso em: 27 abr. 2024.
    • APA

      Santos, L. M. R. dos, Michelon, P., Arenales, M. N., & Santos, R. H. S. (2011). Crop rotation scheduling with adjacency constraints. Annals of Operations Research, 190( 1), 165-180. doi:10.1007/s10479-008-0478-z
    • NLM

      Santos LMR dos, Michelon P, Arenales MN, Santos RHS. Crop rotation scheduling with adjacency constraints [Internet]. Annals of Operations Research. 2011 ; 190( 1): 165-180.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-008-0478-z
    • Vancouver

      Santos LMR dos, Michelon P, Arenales MN, Santos RHS. Crop rotation scheduling with adjacency constraints [Internet]. Annals of Operations Research. 2011 ; 190( 1): 165-180.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-008-0478-z
  • Source: Annals of Operations Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ALEM JUNIOR, Douglas José et al. On the cutting stock problem under stochastic demand. Annals of Operations Research, v. 179, n. 1, p. 169-186, 2010Tradução . . Disponível em: https://doi.org/10.1007/s10479-008-0454-7. Acesso em: 27 abr. 2024.
    • APA

      Alem Junior, D. J., Munari Junior, P. A., Arenales, M. N., & Ferreira, P. A. V. (2010). On the cutting stock problem under stochastic demand. Annals of Operations Research, 179( 1), 169-186. doi:10.1007/s10479-008-0454-7
    • NLM

      Alem Junior DJ, Munari Junior PA, Arenales MN, Ferreira PAV. On the cutting stock problem under stochastic demand [Internet]. Annals of Operations Research. 2010 ; 179( 1): 169-186.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-008-0454-7
    • Vancouver

      Alem Junior DJ, Munari Junior PA, Arenales MN, Ferreira PAV. On the cutting stock problem under stochastic demand [Internet]. Annals of Operations Research. 2010 ; 179( 1): 169-186.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-008-0454-7
  • Source: Annals of Operations Research. Unidade: ICMC

    Assunto: OTIMIZAÇÃO COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      POLTRONIERI, Sônia Cristina et al. A coupling cutting stock-lot sizing problems in the paper industry. Annals of Operations Research, v. 157, n. 1, p. 91-104, 2008Tradução . . Disponível em: https://doi.org/10.1007/s10479-007-0200-6. Acesso em: 27 abr. 2024.
    • APA

      Poltronieri, S. C., Poldi, K. C., Toledo, F. M. B. de, & Arenales, M. N. (2008). A coupling cutting stock-lot sizing problems in the paper industry. Annals of Operations Research, 157( 1), 91-104. doi:10.1007/s10479-007-0200-6
    • NLM

      Poltronieri SC, Poldi KC, Toledo FMB de, Arenales MN. A coupling cutting stock-lot sizing problems in the paper industry [Internet]. Annals of Operations Research. 2008 ; 157( 1): 91-104.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-007-0200-6
    • Vancouver

      Poltronieri SC, Poldi KC, Toledo FMB de, Arenales MN. A coupling cutting stock-lot sizing problems in the paper industry [Internet]. Annals of Operations Research. 2008 ; 157( 1): 91-104.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-007-0200-6
  • Source: Annals of Operations Research. Unidade: EP

    Subjects: SEQUENCIAÇÃO DA PRODUÇÃO, OTIMIZAÇÃO COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      RONCONI, Débora Pretti. A branch-and-bound algorithm to minimize the makespan in flowshop with blocking. Annals of Operations Research, n. 138, p. 53-65, 2005Tradução . . Disponível em: https://doi.org/10.1007/s10479-005-2444-3. Acesso em: 27 abr. 2024.
    • APA

      Ronconi, D. P. (2005). A branch-and-bound algorithm to minimize the makespan in flowshop with blocking. Annals of Operations Research, (138), 53-65. doi:10.1007/s10479-005-2444-3
    • NLM

      Ronconi DP. A branch-and-bound algorithm to minimize the makespan in flowshop with blocking [Internet]. Annals of Operations Research. 2005 ;(138): 53-65.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-005-2444-3
    • Vancouver

      Ronconi DP. A branch-and-bound algorithm to minimize the makespan in flowshop with blocking [Internet]. Annals of Operations Research. 2005 ;(138): 53-65.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/s10479-005-2444-3

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024